A trust region method for minimization of nonsmooth functions with linear constraints

نویسندگان

  • José Mario Martínez
  • Antônio Carlos Moretti
چکیده

We introduce a trust region algorithm for minimization of nons-mooth functions with linear constraints. At each iteration, the objective function is approximated by a model fuction that satisses a set of assumptions stated recently by Qi and Sun in the context of unconstrained nonsmooth optimization. The trust region iteration begins with the resolution of an \easy problem", as in recent works of Mart nez and Santos and Friedlander, Mart nez and Santos, for smooth constrained optimization. In practical implementations we use the in-nity norm for deening the trust region, which ts well with the domain of the problem. We prove global convergence and report numerical experiments .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Trust Region Algorithm Model With Radius Bounded Below for Minimization of Locally Lipschitzian Functions∗

The classical trust region algorithm was extended to the nonsmooth minimization problem successful by Qi and Sun. Combining the trust region algorithm of Qi and Sun and the trust region algorithm with radius bounded below of Jiang for solving generalized complementarity problems, this paper present a new trust region algorithm with radius bounded below for the unconstrained nonsmooth optimizati...

متن کامل

Nonsmoothness and the Bfgs Method∗

This paper investigates the potential behavior, both good and bad, of the well-known BFGS algorithm for smooth minimization, when applied to nonsmooth functions. We consider three very particular examples. We first present a simple nonsmooth example, illustrating how BFGS (in this case with an exact line search) typically succeeds despite nonsmoothness. We then study, computationally, the behav...

متن کامل

A Primal-dual Trust-region Algorithm for Minimizing a Non-convex Function Subject to General Inequality and Linear Equality Constraints a Primal-dual Trust-region Algorithm for Non-convex Constrained Minimization

A new primal-dual algorithm is proposed for the minimization of non-convex objective functions subject to general inequality and linear equality constraints. The method uses a primal-dual trust-region model to ensure descent on a suitable merit function. Convergence is proved to second-order critical points from arbitrary starting points. Preliminary numerical results are presented.

متن کامل

An efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems

Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...

متن کامل

Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization

Abstract. Regularized minimization problems with nonconvex, nonsmooth, perhaps nonLipschitz penalty functions have attracted considerable attention in recent years, owing to their wide applications in image restoration, signal reconstruction and variable selection. In this paper, we derive affine-scaled second order necessary and sufficient conditions for local minimizers of such minimization p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 76  شماره 

صفحات  -

تاریخ انتشار 1996